This study evaluates routes followed by residents of the Minneapolis – St.Paul metropolitan area,as measured by the Glo......

The shortest path analysis is the most basic function of GIS network analysis.Dijkstra algorithm is widely recognized as......

In traffic network,link disruptions or recoveries caused by sudden accidents,bad weather and traffic congestion,lead to ......

　　We consider several novel combinatorial optimization problems,which combine the classic shop scheduling problems(nam......

提出了一种基于计算几何学的面向两端线网的布线算法。对于给定的布线平面，该长法首先根据障碍情况构造了包含最短路径信息的强连接......

建立和研究了具有转向惩罚值的网络模型，在引入了罚转向网络符号及规则后，对所建立的罚转向网络模型的有关最短路径的性质进行了研究......

给出了测地图中８－圈及其割线的结构形式，并得出了一个图是直径为３的测地块的一个充要条件。......

讨论网络中结点间路径的问题是图论中的基本问题之一，而求其中任两结点间的最短径已有一些方法，也可采用延长算法，即求出两点间的所有......